منابع مشابه
Greedy decomposition integrals
In this contribution we define a new class of non-linear integrals based on decomposition integrals. These integrals are motivated by greediness of many real-life situations. Another view on this new class of integrals is that it is a generalization of both the Shilkret and PAN integrals. Moreover, it can be seen as an iterated Shilkret integral. Also, an example in time-series analysis is prov...
متن کاملTotally Greedy Coin Sets and Greedy Obstructions
A coin set is a strictly increasing list of positive integers that always begins with 1. A coin set is called greedy when the simple greedy change-making algorithm always produces the fewest number of coins in change. Here, the greedy changemaking algorithm repeatedly selects the largest denomination coin less than the remaining amount until it has assembled the correct change. Pearson has prov...
متن کاملNON-EQUIVALENT GREEDY AND ALMOST GREEDY BASES IN `p
For 1 < p < ∞ and p 6= 2 we construct a family of mutually non-equivalent greedy bases in `p having the cardinality of the continuum. In fact, no basis from this family is equivalent to a rearranged subsequence of any other basis thereof. We are able to extend this statement to the spaces Lp and H1. Moreover, the technique used in the proof adapts to the setting of almost greedy bases where sim...
متن کاملParallelism and Greedy Algorithms
A number of greedy algorithms are examined <and are shown to be probably inherently sequential. Greedy algorithms are presented for finding a maximal path, for finding a . maximal set of disjoint paths in a layered dag, and for finding the largest induced subgraph of a graph that has all vertices of degree at least Ic. It is shown that for all of these algorithms, the problem of determining if ...
متن کاملOn Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract)
Abs t rac t . In this note a greedy algorithm is considered that computes a matching for a graph with a given ordering of its vertices, and those graphs are studied for which a vertex ordering exists such that the greedy algorithm always yields maximum cardinality matchings for each induced subgraph. We show that these graphs, called greedy matchable graphs, are a subclass of weakly triangulate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Climate Change
سال: 2009
ISSN: 1758-678X,1758-6798
DOI: 10.1038/climate.2009.107